Bee-foraging learning particle swarm optimization

نویسندگان

چکیده

Numerous particle swarm optimization (PSO) algorithms have been developed for solving numerical problems in recent years. However, most of existing PSO only one search phase. There is no strengthened phase the well-performed particles, and also re-initialization exhausted particles. These issues may still restrict performance complex problems. In this paper, inspired by bee-foraging mechanism artificial bee colony algorithm, a novel learning (BFL-PSO) algorithm proposed. Different from algorithms, proposed BFL-PSO has three different phases, namely employed learning, onlooker scout learning. The works like traditional one-phase-based PSO, while performs around those particles to exploit promising solutions, re-initializes introduce new diversity. comprehensively evaluated on CEC2014 benchmark functions, compared with state-of-the-art as well algorithms. experimental results show that achieves very competitive terms solution accuracy. addition, effectiveness newly introduced phases verified. • Bee-foraging integrated into optimization. developed. Three (employed, scout) are adopted BFL-PSO. exhibits

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Feedback learning particle swarm optimization

In this paper, a feedback learning particle swarm optimization algorithm with quadratic inertia weight (FLPSOQIW) is developed to solve optimization problems. The proposed FLPSO-QIW consists of four steps. Firstly, the inertia weight is calculated by a designed quadratic function instead of conventional linearly decreasing function. Secondly, acceleration coefficients are determined not only by...

متن کامل

Learning in Particle Swarm Optimization

This paper presents particle swarm optimization based on learning from winner particle. (PSO-WS). Instead of considering gbest and pbest particle for position update, each particle considers its distance from immediate winner to update its position. Only winner particle follow general velocity and position update equation. If this strategy performs well for the particle, then that particle upda...

متن کامل

Auto-Clustering Using Particle Swarm Optimization and Bacterial Foraging

This paper presents a hybrid approach for clustering based on particle swarm optimization (PSO) and bacteria foraging algorithms (BFA). The new method AutoCPB (Auto-Clustering based on particle bacterial foraging) makes use of autonomous agents whose primary objective is to cluster chunks of data by using simplistic collaboration. Inspired by the advances in clustering using particle swarm opti...

متن کامل

Bee-inspired foraging in an embodied swarm

We show the emergence of Swarm Intelligence in physical robots. We transfer an optimization algorithm which is based on beeforaging behavior to a robotic swarm. In simulation this algorithm has already been shown to be more effective, scalable and adaptive than algorithms inspired by ant foraging. In addition to this advantage, bee-inspired foraging does not require (de-)centralized simulation ...

متن کامل

Particle Swarm Optimization with Double Learning Patterns

Particle Swarm Optimization (PSO) is an effective tool in solving optimization problems. However, PSO usually suffers from the premature convergence due to the quick losing of the swarm diversity. In this paper, we first analyze the motion behavior of the swarm based on the probability characteristic of learning parameters. Then a PSO with double learning patterns (PSO-DLP) is developed, which ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Soft Computing

سال: 2021

ISSN: ['1568-4946', '1872-9681']

DOI: https://doi.org/10.1016/j.asoc.2021.107134